Clique Trees of Infinite Locally Finite Chordal Graphs
نویسندگان
چکیده
منابع مشابه
Clique Graphs of Chordal and Path Graphs
Clique graphs of chordal and path graphs are characterized. A special class of graphs named expanded trees is discussed. It consists of a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Diierent characterizations of expanded trees are...
متن کاملReduced clique graphs of chordal graphs
We investigate the properties of chordal graphs that follow from the well-known fact that chordal graphs admit tree representations. In particular, we study the structure of reduced clique graphs which are graphs that canonically capture all tree representations of chordal graphs. We propose a novel decomposition of reduced clique graphs based on two operations: edge contraction and removal of ...
متن کاملClique cutsets beyond chordal graphs
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced sub...
متن کاملChordal Graphs and Their Clique Graphs
In the rst part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that generalizes both Maximal cardinality Search (MCS) and Lexicographic Breadth rst search is presented. The tra...
متن کاملGeneralized clique coverings of chordal graphs
Two main types 1)£ clique coveri cd phs ha'J(? d j,scussed. One is ali que c C) v p r i r, 9 Cl f \! l-''', ice S , a set ,-, f clIques which between them contain eve! 'JI? te:,c at once. The other, a clique c:-overing of edgEs, is a set f cliques which between them contain eVPIY e0ge. CllVering of edges may be deflned as a lique covering of vertices with the added rest iction hat tho=> I:'"nds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/3928